Internal Approachability and Reflection

نویسندگان

  • JOHN KRUEGER
  • James Cummings
  • Matt Foreman
چکیده

We prove that the Weak Reflection Principle does not imply that every stationary set reflects to an internally approachable set. We show that several variants of internal approachability, namely internally unbounded, internally stationary, and internally club, are not provably equivalent. Let λ ≥ ω2 be a regular cardinal, and consider an elementary substructure N ≺ H(λ) with size א1. Then N is internally approachable if N is the union of an increasing and continuous chain 〈ai : i < ω1〉 of countable sets such that for all β < ω1, 〈ai : i < β〉 is in N . The Weak Reflection Principle or WRP is the statement that for all regular λ ≥ ω2, for every stationary set S ⊆ Pω1(H(λ)) there is a set N ⊆ H(λ) with size א1 which contains א1 such that S ∩Pω1(N) is stationary in Pω1(N) (that is, S reflects to N). This principle follows from Martin’s Maximum and captures some of its strength; for example, WRP implies Chang’s Conjecture, the presaturation of the non-stationary ideal on ω1, and the Singular Cardinal Hypothesis (see [3] and [6]). An apparent strengthening of WRP is the statement that for all regular λ ≥ ω2, every stationary subset of Pω1(H(λ)) reflects to an internally approachable set with size א1. In practice it tends to be easier to draw strong consequences from this principle than from WRP. Foreman and Todorčević [4] asked whether the two reflection principles are equivalent. We answer this question in the negative. Theorem 0.1. Suppose κ is supercompact. Then there is a forcing poset which forces κ = ω2, WRP holds, and for all regular λ ≥ ω2 there is a stationary subset of Pω1(H(λ)) which does not reflect to any internally approachable set with size א1. Foreman and Todorčević [4] described several variations of the notion of internal approachability, and asked whether these properties are equivalent. Let N ≺ H(λ) be a set with size א1. Then N is internally club if N∩Pω1(N) contains a club subset of Pω1(N). N is internally stationary if N ∩ Pω1(N) is stationary in Pω1(N). N is internally unbounded if N ∩ Pω1(N) is cofinal in Pω1(N). We prove that these properties are not equivalent. Theorem 0.2. MM implies that for all regular λ ≥ ω2, there is a stationary set of N in Pω2(H(λ)) which are internally unbounded but not internally stationary. Theorem 0.3. PFA2 implies that for all regular λ ≥ ω2, there is a stationary set of N in Pω2(H(λ)) which are internally stationary but not internally club. I would like to thank James Cummings, Matt Foreman, and Assaf Sharon for discussing the material in this paper with me. I note that Theorem 0.2 was proved independently by Assaf Sharon with essentially the same argument. This work was partially supported by FWF project number P16790-N04.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Consequences of Reflection on the Approachability Ideal

We study the approachability ideal I[κ+] in the context of large cardinals and properties of the regular cardinals below a singular κ. As a guiding example consider the approachability ideal I[אω+1] assuming that אω is a strong limit. In this case we obtain that club many points in אω+1 of cofinality אn for some n > 1 are approachable assuming the joint reflection of countable families of stati...

متن کامل

Robust approachability and regret minimization in games with partial monitoring

Approachability has become a standard tool in analyzing learning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set, rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop simple and efficie...

متن کامل

Set-valued approachability and online learning with partial monitoring

Approachability has become a standard tool in analyzing learning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward: it belongs to a set rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop a simple and general...

متن کامل

A Thin Layer Imaging with the Total Internal Reflection Fluorescence Microscopy

Total internal reflection fluorescence microscopy (TIRFM) is an optical technique that allows imaging of a thin layer of the sample with a thickness of about 100-200 nm. It is used in science of cell biology to study cellular processes, especially near the membranes of living cells. This method is based on the total internal reflection phenomenon, where the evanescent wave is generated in the l...

متن کامل

Zero - Sum Games with Vector - Valued Payoffs

In this lecture we formulate and prove the celebrated approachability theorem of Blackwell, which extends von Neumann's minimax theorem to zero-sum games with vector-valued payoffs [1]. (The proof here is based on the presentation in [2]; a similar presentation was given by Foster and Vohra [3].) This theorem is powerful in its own right, but also has significant implications for regret minimiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008